Some Notes on Fine Computability

نویسنده

  • Vasco Brattka
چکیده

A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Walsh analysis. We investigate computability properties of a corresponding Fine representation of the real numbers and we construct a structure which characterizes this representation. Moreover, we introduce a general class of Fine computable functions and we compare this class with the class of locally uniformly Fine computable functions defined by Mori. Both classes of functions include all ordinary computable functions and, additionally, some important functions which are discontinuous with respect to the usual Euclidean metric. Finally, we prove that the integration operator on the space of Fine continuous functions is lower semi-computable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Algorithmic Strong Sufficient Statistics

The notion of a strong sufficient statistic was introduced in [N. Vereshchagin, Algorithmic Minimal Sufficient Statistic Revisited. Proc. 5th Conference on Computability in Europe, CiE 2009, LNCS 5635, pp. 478-487]. In this paper, we give a survey of fine properties of strong sufficient statistics and show that there are strings for which complexity of every strong sufficient statistic is much ...

متن کامل

On Elementary Computability-Theoretic Properties of Algorithmic Randomness

In this paper we apply some elementary computability-theoretic notions to algorithmic complexity theory with the aim of understanding the role and extent of computability techniques for algorithmic complexity theory. We study some computability-theoretic properties of two different notions of randomness for finite strings: randomness based on the blank-endmarker complexity measure and Chaitin’s...

متن کامل

Integral of Fine Computable functions and Walsh Fourier series

We define the effective integrability of Fine-computable functions and effectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theorem and Dominated Convergence Theorem. It is also proved that the Walsh-Fourier coefficients of an effectively integrable Finecomputable function form an E-computable sequence of reals and converge effectively to ze...

متن کامل

Sequential Computability of a Function. Effective Fine Space and Limiting Recursion

We consider real sequences in I = [0, 1) and real functions on I . It is first shown that, as for real sequences from I , R-computability (computability with respect to the Euclidean topology) implies “weak Fine-computability.” Using this result, we show that “Fine-sequential computability” and “L∗-sequential computability” are equivalent for effectively locally Fine-continuous functions as wel...

متن کامل

Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability

Peter Wegner’s definition of computability differs markedly from the classical term as established by Church, Kleene, Markov, Post, Turing et al. Wegner identifies interaction as the main feature of today’s systems which is lacking in the classical treatment of computability. We compare the different approaches and argue whether or not Wegner’s criticism is appropriate. Taking into account the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2002